Kiyoshi NISHIKAWA Takuya YAMAUCHI Hitoshi KIYA
In this paper, we consider the selection of analysis filters used in the delayless subband adaptive digital filter (SBADF) and propose to use simple analysis filters to reduce the computational complexity. The coefficients of filters are determined using the components of the first order Hadamard matrix. Because coefficients of Hadamard matrix are either 1 or -1, we can analyze signals without multiplication. Moreover, the conditions for convergence of the proposed method is considered. It is shown by computer simulations that the proposed method can converge to the Wiener filter.
Shogo MURAMATSU Akihiko YAMADA Hitoshi KIYA
In this paper, a two-dimensional (2-D) binary-valued (BV) lapped transform (LT) is proposed. The proposed LT has basis images which take only BV elements and satisfies the axial-symmetric (AS) property. In one dimension, there is no 2-point LT with the symmetric basis vectors, and the property is achieved only with the non-overlapping basis which the Hadamard transform (HT) has. Hence, in two dimension, there is no 22-point separable ASLT, and only 2-D HT can be the 22-point separable AS orthogonal transform. By taking non-separable BV basis images, this paper shows that a 22-point ASLT can be obtained. Since the proposed LT is similar to HT, it is referred to as the lapped Hadamard transform (LHT). LHT of larger size is shown to be provided with a tree structure. In addition, LHT is shown to be efficiently implemented by a lattice structure.
Yasuhiro HARADA Shogo MURAMATSU Hitoshi KIYA
The checkerboard effect is caused by the periodic time-variant property of multirate filters which consist of up-samplers and digital filters. Although the conditions for some one-dimensional (1D) multirate systems to avoid the checkerboard effect have been shown, the conditions for Multidimensional (MD) multirate systems have not been considered. In this paper, some theorems about the conditions for MD multirate filters without checkerboard effect are derived. In addition, we also consider MD multirate filter banks without checkerboard effect. Simulation examples show that the checkerboard effect can be avoided by using the proposed conditions.
Shoko IMAIZUMI Yusuke IZAWA Ryoichi HIRASAWA Hitoshi KIYA
We propose a reversible data hiding (RDH) method in compressible encrypted images called the encryption-then-compression (EtC) images. The proposed method allows us to not only embed a payload in encrypted images but also compress the encrypted images containing the payload. In addition, the proposed RDH method can be applied to both plain images and encrypted ones, and the payload can be extracted flexibly in the encrypted domain or from the decrypted images. Various RDH methods have been studied in the encrypted domain, but they are not considered to be two-domain data hiding, and the resultant images cannot be compressed by using image coding standards, such as JPEG-LS and JPEG 2000. In our experiment, the proposed method shows high performance in terms of lossless compression efficiency by using JPEG-LS and JPEG 2000, data hiding capacity, and marked image quality.
Toshiyuki DOBASHI Tatsuya MUROFUSHI Masahiro IWAHASHI Hitoshi KIYA
A global tone mapping operation (TMO) for high dynamic range (HDR) images with fixed-point arithmetic is proposed and evaluated in this paper. A TMO generates a low dynamic range (LDR) image from an HDR image by compressing its dynamic range. Since an HDR image is generally expressed in a floating-point data format, a TMO also deals with floating-point data even though a resultant LDR image is integer data. The proposed method treats a floating-point number as two 8-bit integer numbers which correspond to an exponent part and a mantissa part, and applies tone mapping to these integer numbers separately. Moreover, the method conducts all calculations in the tone mapping with only fixed-point arithmetic. As a result, the method reduces a memory cost and a computational cost. The evaluation shows that the proposed method reduces 81.25% of memory usage. The experimental results show that the processing speed of the proposed method with fixed-point arithmetic is 23.1 times faster than the conventional method with floating-point arithmetic. Furthermore, they also show the PSNR of LDR images obtained by the proposed method are comparable to those of the conventional method, though reducing computational and memory cost.
Xiaoxia ZOU Shogo MURAMATSU Hitoshi KIYA
Block delay caused by using fast Fourier transform (FFT), and computational complexity in sampling rate conversion system are considered in this paper. The relationship between the number of block delays and the computational complexity is investigated. The proposed method can avoid the redundant operations of sampling rate conversion completely and moreover provide a good trade-off between the number of block delays and the computational complexity. As a result, ti is shown that with the proposed method, the sampling rate conversion can be realized more efficiently under a small number of block delays.
Fitri ARNIA Ikue IIZUKA Masaaki FUJIYOSHI Hitoshi KIYA
Two schemes for fast identification of JPEG coded images are proposed in this paper. The aim is to identify the JPEG images that are generated from the same original image and have equivalent or different compression ratios. Fast identification can be achieved since the schemes work on the quantized Discrete Cosine Transform (DCT) domain. It is not required to inverse the quantization and the DCT. Moreover, only a few coefficients are commonly required for identification. The first approach can avoid identification leakage or false negative (FN), and probably result in a few false positives (FP). The second approach can avoid both FN and FP, with a slightly higher processing time. By combining the two schemes, a faster and a more perfect identification can be achieved, in which FN and FP can be avoided.
Kiyoshi NISHIKAWA Shinichi NAGAWARA Hitoshi KIYA
In this paper, we propose a novel QoS (Quality of Service) estimation scheme for JPEG 2000 coded image at RTP (realtime transfer protocol) layer without decoding the image. QoS of streaming video is estimated in view of several points, such as, transmission delay, or quality of received images. In this paper, we evaluate the QoS in terms of quality of received images. Generally, RTP is carried on top of UDP, and hence, quality of transmitted images could be degraded due to packet loss. To estimate the quality of received JPEG 2000 coded image without decoding, we use RTP header extension in order to send additional information to the receiver. The effectiveness of the proposed method is confirmed by the computer simulations.
Seungwu HAN Masaaki FUJIYOSHI Hitoshi KIYA
This paper proposes an image authentication method that detects tamper and localizes tampered areas efficiently. The efficiency of the proposed method is summarized as the following three points. 1) This method offers coarse-to-fine tamper localization by hierarchical data hiding so that further tamper detection is suppressed for blocks labeled as genuine in the uppper layer. 2) Since the image feature description in the top layer is hidden over an image, the proposed method enciphers the data in the top layer rather than enciphers all data in all layers. 3) The proposed method is based on the reversible data hiding scheme that does not use highly-costed compression technique. These three points makes the proposed method superior to the conventional methods using compression techniques and methods using multi-tiered data hiding that requires integrity verification in many blocks even the image is genuine. Simulation results show the effectiveness of the proposed method.
This paper proposes a block-permutation-based encryption (BPBE) scheme for the encryption-then-compression (ETC) system that enhances the color scrambling. A BPBE image can be obtained through four processes, positional scrambling, block rotation/flip, negative-positive transformation, and color component shuffling, after dividing the original image into multiple blocks. The proposed scheme scrambles the R, G, and B components independently in positional scrambling, block rotation/flip, and negative-positive transformation, by assigning different keys to each color component. The conventional scheme considers the compression efficiency using JPEG and JPEG 2000, which need a color conversion before the compression process by default. Therefore, the conventional scheme scrambles the color components identically in each process. In contrast, the proposed scheme takes into account the RGB-based compression, such as JPEG-LS, and thus can increase the extent of the scrambling. The resilience against jigsaw puzzle solver (JPS) can consequently be increased owing to the wider color distribution of the BPBE image. Additionally, the key space for resilience against brute-force attacks has also been expanded exponentially. Furthermore, the proposed scheme can maintain the JPEG-LS compression efficiency compared to the conventional scheme. We confirm the effectiveness of the proposed scheme by experiments and analyses.
In the case that images are shared via social networking services (SNS) and cloud photo storage services (CPSS), it is known that the JPEG images uploaded to the services are mostly re-compressed by the providers. Because of such a situation, a new image identification scheme for double-compressed JPEG images is proposed in this paper. The aim is to detect a single-compressed image that has the same original image as the double-compressed ones. In the proposed scheme, a feature extracted from only DC coefficients in DCT coefficients is used for the identification. The use of the feature allows us not only to robustly avoid errors caused by double-compression but also to perform the identification for different size images. The simulation results demonstrate the effectiveness of the proposed one in terms of the querying performance.
Tatsuya CHUMAN Kenta IIDA Warit SIRICHOTEDUMRONG Hitoshi KIYA
Encryption-then-Compression (EtC) systems have been proposed to securely transmit images through an untrusted channel provider. In this study, EtC systems were applied to social media like Twitter that carry out image manipulations. The block scrambling-based encryption schemes used in EtC systems were evaluated in terms of their robustness against image manipulation on social media. The aim was to investigate how five social networking service (SNS) providers, Facebook, Twitter, Google+, Tumblr and Flickr, manipulate images and to determine whether the encrypted images uploaded to SNS providers can avoid being distorted by such manipulations. In an experiment, encrypted and non-encrypted JPEG images were uploaded to various SNS providers. The results show that EtC systems are applicable to the five SNS providers.
Masaaki FUJIYOSHI Shoko IMAIZUMI Hitoshi KIYA
An encryption scheme is proposed that considers hierarchies in media, such as text, images, sound, and so on, in a composite multimedia content to enable versatile access control. In the proposed scheme, a content provider has only one managed key (the master key) for a particular composite multimedia content, and an user who is permitted to access a reserved content entities in the composite content receives only one key that is subordinately generated from the master key. Another key generated from the identical master key is delivered to another user, and this permits the user to access different entities. This scheme introduces a new key concept, namely "unusable key," to keep all entities encrypted in a particular medium and to simultaneously decrypt several entities in other media. The other new key, "numbering key," is also used in this scheme to support simultaneous partial decryption of multiple images that are coded with a scalable coding technology. Simulation results show the effectiveness of the proposed scheme; in particular, the length of the managed master key and that of keys to be delivered to users are small.
A method of scrambling MPEG video by exchanging the motion vector (MV) in the MPEG bitstream is proposed. It deals directly with the MPEG bitstream and exclusive MPEG encoders are unnecessary. The size of the scrambled bitstream does not increase and image quality is maintained after descrambling. Moreover, the structure of the MPEG bitstream is maintained and can be decoded with a standard MPEG video decoder. We demonstrate the effectiveness of this method through simulation results that reveal unchanged image quality and size of bitstreams.
Hong Lin JIN Masaaki FUJIYOSHI Hitoshi KIYA
A lossless data embedding method that inserts data in images in the spatial domain is proposed in this paper. Though a lossless data embedding method once distorts an original image to embed data into the image, the method restores the original image as well as extracts hidden data from the image in which the data are embedded. To guarantee the losslessness of data embedding, all pixel values after embedding must be in the dynamic range of pixels. Because the proposed method modifies some pixels to embed data and leaves other pixels as their original values in the spatial domain, it can easily keep all pixel values after embedding in the dynamic range of pixels. Thus, both the capacity and the image quality of generated images are simultaneously improved. Moreover, the proposed method uses only one parameter based on the statistics of pixel blocks to embed and extract data. By using this parameter, this method does not require any reference images to extract embedded data nor any memorization of the positions of pixels in which data are hidden to extract embedded data. In addition, the proposed method can control the capacity for hidden data and the quality of images conveying hidden data by controlling the only one parameter. Simulation results show the effectiveness of the proposed method; in particular, it offers images with superior image quality to conventional methods.
Akio HARADA Kiyoshi NISHIKAWA Hitoshi KIYA
In this paper, we propose two new pipelined adaptive digital filter architectures. The architectures are based on an equivalent expression of the least mean square (LMS) algorithm. It is shown that one of the proposed architectures achieves the minimum output latency, or zero without affecting the convergence characteristics. We also show that, by increasing the output latency be one, the other architecture can be obtained which has a shorter critical path.
Yuma KINOSHITA Sayaka SHIOTA Hitoshi KIYA
This paper proposes a novel pseudo multi-exposure image fusion method based on a single image. Multi-exposure image fusion is used to produce images without saturation regions, by using photos with different exposures. However, it is difficult to take photos suited for the multi-exposure image fusion when we take a photo of dynamic scenes or record a video. In addition, the multi-exposure image fusion cannot be applied to existing images with a single exposure or videos. The proposed method enables us to produce pseudo multi-exposure images from a single image. To produce multi-exposure images, the proposed method utilizes the relationship between the exposure values and pixel values, which is obtained by assuming that a digital camera has a linear response function. Moreover, it is shown that the use of a local contrast enhancement method allows us to produce pseudo multi-exposure images with higher quality. Most of conventional multi-exposure image fusion methods are also applicable to the proposed multi-exposure images. Experimental results show the effectiveness of the proposed method by comparing the proposed one with conventional ones.
Teerapong ORACHON Taichi YOSHIDA Somchart CHOKCHAITAM Masahiro IWAHASHI Hitoshi KIYA
The lifting wavelet transform (WT) has been widely applied to image coding. Recently, the total number of lifting steps has been minimized introducing a non-separable 2D structure so that delay from input to output can be reduced in parallel processing. However the minimum lifting WT has a problem that its upper bound of the rate-distortion curve is lower than that of the standard lifting WT. This is due to the rounding noise generated inside the transform in its integer implementation. This paper reduces the rounding noise introducing channel scaling. The channel scaling is designed so that the dynamic range of signal values is fully utilized at each channel inside the transform. As a result, the signal to noise ratio is increased and therefore the upper bound of the minimum lifting WT in lossy coding is improved.
Shenchuan LIU Masaaki FUJIYOSHI Hitoshi KIYA
This paper introduces amplitude-only images to image trading systems in which not only the copyright of images but also the privacy of consumers are protected. In the latest framework for image trading systems, an image is divided into an unrecognizable piece and a recognizable but distorted piece to simultaneously protect the privacy of a consumer and the copyright of the image. The proposed scheme uses amplitude-only images which are completely unrecognizable as the former piece, whereas the conventional schemes leave recognizable parts to the piece which degrades privacy protection performance. Moreover, the proposed scheme improves the robustness against copyright violation regardless of the used digital fingerprinting technique, because an amplitude-only image is larger than the piece in the conventional scheme. In addition, phase-only image is used as the second piece in the proposed scheme, the consumer can confirm what he/she bought. Experimental results show the effectiveness of the proposed scheme.
Wannida SAE-TANG Shenchuan LIU Masaaki FUJIYOSHI Hitoshi KIYA
In this paper, a compression-friendly copyright- and privacy-protected image trading system is proposed. In the image trading system, the copyright of the image and the consumer's privacy is important. In addition, it should preserve existing image compression standards. In the proposed method, for privacy protection, the content provider (CP) multiplies random signs to the discrete wavelet transformed (DWTed) coefficients of an image to generate the visually encrypted image. The proposed visually protected images can be efficiently compressed by using JPEG 2000 which compresses the image in the DWTed domain as well. For copyright protection, the trusted third party (TTP) applies digital fingerprinting to the image in the encrypted domain. While in the conventional system, the amplitude-only image (AOI) which is the inversely transformed amplitude spectra of an image is used for privacy protection. Since, the AOI consists of real numbers, to store and transmit the AOI, it has to be quantized before compression. Therefore, quantization errors cannot be avoided in the conventional system. On the other hand, the proposed method applies the digital fingerprint in the DWTed domain, so clipping errors in decoding the image by the TTP is avoided. In addition, only a seed number which is input to a pseudo random number generator is shared between the CP and the consumer, whereas an extra image is shared in the conventional systems. Experimental results show that the proposed system is efficient in terms of privacy protection, compression performance, quality of fingerprinted images, and correct fingerprint extracting performance.